Computer Arithmetic Preserving Hamming Distance of Operands in Operation Result

نویسندگان

  • Shlomi Dolev
  • Sergey Frenkel
  • Dan E. Tamir
چکیده

The traditional approach to fault tolerant computing involves replicating computation units and applying a majority vote operation on individual result bits. This approach, however, has several limitations; the most severe is the resource requirement. This paper presents a new method for fault tolerant computing where for a given error rate, , the hamming distance between correct inputs and faulty inputs as well as the hamming distance between a correct result and a faulty result is preserved throughout processing thereby enabling correction of up to transient faults per computation cycle. The new method is compared and contrasted with current protection methods and its cost / performance is analyzed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Hamming Processor

Given Hamming coded or systematic Bose–Chaudhuri-Hocquenghem (BCH) or Reed-Solomon correctable operands x and y and an operation op , we present arithmetic to compute the operation Correct( x )opCorrect(y) while preserving the correct-ability of the result. If the Hamming distance of x(y) from Correct(x) (Correct(y)) is dx (dy, respectively) and the maximal correctable distance is dc then our i...

متن کامل

Dynamic operand transformation for low-power multiplier-accumulator design

The design of portable battery-operated devices requires low-power computation circuits. This paper presents a new multiplier-accumulator (MAC) design approach, which in contrast to existing methods exploits dynamic operand transformation to reduce power consumption. The key idea is to compare current values of input operands with previous values and depending on computed Hamming distance to us...

متن کامل

Caching Function Results: Faster Arithmetic by Avoiding Unnecessary Computation

This paper discusses trivial computation, where simple operands trivialize potentially complex operations. An example of a trivial operation is integer division, where the divisor is two; the division becomes a simple shift operation. The paper also discusses the concept of redundant computation, where some operation repeatedly does the same function because it repeatedly sees the same operands...

متن کامل

Provably Secure Countermeasures against Side-channel Attacks

Side-channel attacks exploit the fact that the implementations of cryptographic algorithms leak information about the secret key. In power analysis attacks, the observable leakage is the power consumption of the device, which is dependent on the processed data and the performed operations. Masking is a widely used countermeasure to thwart the powerful Differential Power Analysis (DPA) attacks. ...

متن کامل

Random projections weakly preserving the Hamming distance between words

Random projections in the Euclidean space reduce the dimensionality of the data approximately preserving the distances between points. In the hypercube it holds a weaker property: random projections approximately preserve the distances within a certain range. In this note, we show an analogous result for the metric space 〈 Σ, dH 〉 , where Σ is the set of words of length d on alphabet Σ and dH i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1104.3310  شماره 

صفحات  -

تاریخ انتشار 2011